SIAM Journal on Computing -- 1982

By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© SIAM

SIAM Journal on Computing

ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.

Table of Contents

Available Volumes| Issue Index| View myArticles

Search This Issue

Volume 11, Issue 1, pp. 1-199

Please Note: Electronic articles are available well in advance of the printed articles.

Straight-Line Programs with One Input Variable

Oscar H. Ibarra and Brian S. Leininger

pp. 1-14

BibTeX Abstract Full Text: PDF

The Complexity of the Equivalence Problem for Simple Loop-Free Programs

Oscar H. Ibarra and Brian S. Leininger

pp. 15-27

BibTeX Abstract Full Text: PDF

A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One

J. H. Halton and R. Terada

pp. 28-46

BibTeX Abstract Full Text: PDF

Dynamic Programming is Optimal for Nonserial Optimization Problems

Arnon Rosenthal

pp. 47-59

BibTeX Abstract Full Text: PDF

On the Expected Performance of Scanning Disks

E. G. Coffman, Jr. and Micha Hofri

pp. 60-70

BibTeX Abstract Full Text: PDF

A Hidden-Line Algorithm for Hyperspace

Robert P. Burton and David R. Smith

pp. 71-80

BibTeX Abstract Full Text: PDF

Symbolic Program Analysis in Almost-Linear Time

John H. Reif and Robert E. Tarjan

pp. 81-93

BibTeX Abstract Full Text: PDF

Analysis of a General Mass Storage System

D. Coppersmith, D. S. Parker, and C. K. Wong

pp. 94-116

BibTeX Abstract Full Text: PDF

Algorithms for Edge Coloring Bipartite Graphs and Multigraphs

Harold N. Gabow and Oded Kariv

pp. 117-129

BibTeX Abstract Full Text: PDF

Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations

pp. 130-137

BibTeX Abstract Full Text: PDF

Minimum Variance Huffman Codes

Lawrence T. Kou

pp. 138-148

BibTeX Abstract Full Text: PDF

Polygon Retrieval

pp. 149-165

BibTeX Abstract Full Text: PDF

A Polynomial Time Algorithm for Deciding the Equivalence Problem for $2$-Tape Deterministic Finite State Acceptors

E. P. Friedman and S. A. Greibach

pp. 166-183

BibTeX Abstract Full Text: PDF

Complexity of Matroid Property Algorithms

Per M. Jensen and Bernhard Korte

pp. 184-190

BibTeX Abstract Full Text: PDF

Dominating Sets in Chordal Graphs

Kellogg S. Booth and J. Howard Johnson

pp. 191-199

BibTeX Abstract Full Text: PDF